Interactive Genetic Algorithms with Grey Level of Individual Interval Fitness
نویسندگان
چکیده
منابع مشابه
Interactive Genetic Algorithms with Individual Fitness Not Assigned by Human
Interactive genetic algorithms (IGAs) are effective methods to solve optimization problems with implicit or fuzzy indices. But human fatigue problem, resulting from evaluation on individuals and assignment of their fitness, is very important and hard to solve in IGAs. Aiming at solving the above problem, an interactive genetic algorithm with an individual fitness not assigned by human is propos...
متن کامل2 Interactive Genetic Algorithms with Individual ’ s Uncertain Fitness
Interactive genetic algorithms (IGAs), proposed in mid 1980s, are effective methods to solve an optimization problem with implicit or fuzzy indices (Dawkins, 1986). These algorithms combine traditional evolution mechanism with a user’s intelligent evaluation, and the user assigns an individual’s fitness rather than a function that is difficult or even impossible to explicitly express. Up to now...
متن کاملFitness Interpolation in Interactive Genetic Algorithms
We attack the problem of user fatigue in using an interactive genetic algorithm to evolve two case studies: user interfaces and floorplans. We show that we can reduce human fatigue in interactive genetic algorithms (the number of choices needing to be made by the user), by 1) only asking the user to evaluate a small subset from a large population size, and 2) by asking the user to make the choi...
متن کاملSimple Genetic Algorithms with Linear Fitness
A general form of stochastic search is described (random heuristic search) and some of its general properties are proved. This provides a framework in which the simple genetic algorithm (SGA) is a special case. The framework is used to illuminate relationships between seemingly diierent probabilistic perspectives of SGA behavior. Next, the SGA is formalized as an instance of random heuristic se...
متن کاملGraphic Object Layout with Interactive Genetic Algorithms
Automatic graphic object layout methods have long been studied in many application areas in which graphic objects should be laid out to satisfy the constraints specific to each application. In those areas, carefully designed layout algorithms should be used to satisfy each application’s constraints. However, those algorithms tend to be complicated and not reusable for other applications. Moreov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advanced Engineering Forum
سال: 2011
ISSN: 2234-991X
DOI: 10.4028/www.scientific.net/aef.1.193